Performance Comparison of ASD Computation Methods for Self- Synchronizing T-Codes

T-codes are variable-length codes (VLC) generated by an iterative construction algorithm known as the T-augmentation [5], [6]. All T-codes possess strong self-synchronizing properties by virtual of Taugmentation, which spreads synchronization information throughout the code construction. In particular, self-synchronism is attained as a natural consequence of the decoding process following a lock loss. A thorough treatment of the decoding process has been presented in [3]. This has led to an improved method for the computation of the average sync delay (ASD) associated with individual T-code sets [1], which is based on a tree construction algorithm [2]. This letter presents a direct performance comparison of the novel ASD computation method [2] against the original method described in [4].